Heuristic Search-Based Replanning
نویسندگان
چکیده
Many real-world planning problems require one to solve a series of similar planning tasks. In this case, replanning can be much faster than planning from scratch. In this paper, we introduce a novel replanning method for symbolic planning with heuristic search-based planners, currently the most popular planners. Our SHERPA replanner is not only the first heuristic search-based replanner but, different from previous replanners for other planning paradigms, it also guarantees that the quality of its plans is as good as that achieved by planning from scratch. We provide an experimental feasibility study that demonstrates the promise of SHERPA for heuristic search-based replanning.
منابع مشابه
Anytime Truncated D* : Anytime Replanning with Truncation
Incremental heuristic searches reuse their previous search efforts to speed up the current search. Anytime search algorithms iteratively tune the solutions based on available search time. Anytime D* (AD*) is an incremental anytime search algorithm that combines these two approaches. AD* uses an inflated heuristic to produce bounded suboptimal solutions and improves the solution by iteratively d...
متن کاملSpeeding up the Parti-Game Algorithm
In this paper, we introduce an efficient replanning algorithm for nondeterministic domains, namely what we believe to be the first incremental heuristic minimax search algorithm. We apply it to the dynamic discretization of continuous domains, resulting in an efficient implementation of the parti-game reinforcement-learning algorithm for control in high-dimensional domains.
متن کاملPlanning for Modular Printers: Beyond Productivity
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution failures and multi-objective preferences. A printer controller must plan quickly and reliably, otherwise expensive human intervention will be required. Our approach is practical and efficient, and showcases the flexibi...
متن کاملIntegrated Planning and Execution: Elastic Strips
Real-time replanning is a prerequisite for motion execution in unpredictably changing environments. This paper presents a framework that allows real-time replanning in high-dimensional configuration spaces. Initially, a planning operation generates a path. The path is augmented by a set of paths homotopic to it. This set is represented implicitly by a volume of free space in the workspace. Effe...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002